Search results for "Flow shop scheduling"

showing 4 items of 4 documents

Reference point based multi-objective evolutionary algorithms for group decisions

2008

While in the past decades research on multi-objective evolutionary algorithms (MOEA) has aimed at finding the whole set of Pareto optimal solutions, current approaches focus on only those parts of the Pareto front which satisfy the preferences of the decision maker (DM). Therefore, they integrate the DM early on in the optimization process instead of leaving him/her alone with the final choice of one solution among the whole Pareto optimal set. In this paper, we address an aspect which has been neglected so far in the research on integrating preferences: in most real-world problems, there is not only one DM, but a group of DMs trying to find one consensus decision all participants are wille…

Mathematical optimizationProcess (engineering)Evolutionary algorithmA priori and a posterioriBayesian efficiencyFlow shop schedulingFocus (optics)Set (psychology)Multi-objective optimizationMathematics
researchProduct

Parallel Simulated Annealing: Getting Super Linear Speedups

2005

The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve su…

Mathematical optimizationSpeedupComputational complexity theoryJob shop schedulingParallel processing (DSP implementation)Computer scienceSimulated annealingDegree of parallelismFlow shop schedulingParallel computingHypercubeProceedings. Second Euromicro Workshop on Parallel and Distributed Processing
researchProduct

Two Job Cyclic Scheduling with Incompatibility Constraints

2001

The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.

Rate-monotonic schedulingMathematical optimizationJob shop schedulingComputer scienceStrategy and ManagementDistributed computingFlow shop schedulingDynamic priority schedulingManagement Science and Operations ResearchFair-share schedulingMultiprocessor schedulingComputer Science ApplicationsNurse scheduling problemManagement of Technology and InnovationTwo-level schedulingBusiness and International ManagementComputer Science::Operating Systems
researchProduct

HEURISTIC PROCEDURES FOR GROUP SCHEDULING

1989

ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.

Rate-monotonic schedulingTheoretical computer scienceHeuristic (computer science)Computer scienceGroup (mathematics)Two-level schedulingDynamic priority schedulingFlow shop schedulingFair-share schedulingGroup scheduling
researchProduct